منابع مشابه
A Loss Calibarated Methods for Bipartite Rationing Problems
The standard problem of rationing a single overdemanded commodity (O’Neill [1982], Aumann and Maschler [1985], Young [1987]) has a natural bipartite extension with multiple types of a single commodity (e.g., jobs with different skill requirements), and each agent can only consume some types of the resource (e.g., workers have different skills). We define the new standard loss calibrated rationi...
متن کاملThe Bipartite Rationing Problem
In the bipartite rationing problem, a set of agents share a single resource available in different “types”, each agent has a claim over only a subset of the resource-types, and these claims overlap in arbitrary fashion. The goal is to divide fairly the various types of resource between the claimants, when resources are in short supply. With a single type of resource, this is the standard ration...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملRationing problems with ex-ante conditions
An extension of the standard rationing model is introduced. Agents are not only identified by their respective claims on some amount of a scarce resource, but also by some exogenous ex-ante conditions (characteristics), different from claims (e.g., endowments, entitlements, wealth, obligations, assets). Inequalities in the ex-ante conditions induce compensations between agents which influence t...
متن کاملMatchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n− r) blue edges for specified 0 ≤ r ≤ n, is a nontrivial integer program. We present an alternative, logically simpler proof of a theorem in [3] which establishes necessary and sufficient conditions for the existance of a solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGecom Exchanges
سال: 2012
ISSN: 1551-9031
DOI: 10.1145/2325713.2325715